A New Look at Solving Minimax Problems with Coevolution
نویسنده
چکیده
In recent papers, [1, 2, 3], coevolutionary genetic algorithms have been used to solve so-called minimax problems from mechanical structure optimisation, constrained optimisation and scheduling domains. The applications have been quite successful, but the algorithms used require the minimax problems to have a certain property; the problem has to be symmetric in the two search-spaces. In the present article it is argued that the proposed algorithms will fail to converge if the problem is not symmetric. A new approach solving the problem will be demonstrated.
منابع مشابه
A New Objective Penalty Function Approach for Solving Constrained Minimax Problems
In this paper, a new objective penalty function approach is proposed for solving minimax programming problems with equality and inequality constraints. This new objective penalty function combines the objective penalty and constraint penalty. By the new objective penalty function, a constrained minimax problem is converted to minimizations of a sequence of continuously differentiable functions ...
متن کاملSOLVING FUZZY LINEAR PROGRAMMING PROBLEMS WITH LINEAR MEMBERSHIP FUNCTIONS-REVISITED
Recently, Gasimov and Yenilmez proposed an approach for solving two kinds of fuzzy linear programming (FLP) problems. Through the approach, each FLP problem is first defuzzified into an equivalent crisp problem which is non-linear and even non-convex. Then, the crisp problem is solved by the use of the modified subgradient method. In this paper we will have another look at the earlier defuzzifi...
متن کاملA Blended Population Approach to Cooperative Coevolution for Decomposition of Complex Problems
Cooperative coevolutionary architectures provide a framework for solving complex problems by decomposing them into constituent subproblems, solving the subproblems, and then reintegrating the solutions. This paper presents a blended cooperative coevolution model which offers advantages over traditional evolutionary algorithms and currently used cooperative coevolutionary architectures.
متن کاملA New Recurrent Neural Network for Solving Convex Quadratic Programming Problems With an Application to the k -Winners-Take-All Problem
In this paper, a new recurrent neural network is proposed for solving convex quadratic programming (QP) problems. Compared with existing neural networks, the proposed one features global convergence property under weak conditions, low structural complexity, and no calculation of matrix inverse. It serves as a competitive alternative in the neural network family for solving linear or quadratic p...
متن کاملA Minimax Method with Application to the Initial Vector
We consider the problem Minimize max ff 1 (x) can be large. We introduce a new algorithm for solving this problem that can be implemented in rather modest computer environments. The new method is based on a fast one-dimensional newtonian procedure applied to the objective value of an auxiliary function. We report numerical experiments, which suggest that the new algorithm, combined with a power...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001